
Dual encryption for query integrity assurance.

A Temporal Data%2DMining Approach for Discovering End%2Dto%2DEnd Transaction Flows.
Effective management of Web Services systems relies on accurate understanding of end-to-end transaction flows, which may change over time as the service composition evolves. This work takes a data mining approach to automatically recovering end-to-end transaction flows from (potentially obscure) monitoring events produced by monitoring tools. We classify the caller-callee relationships among monitoring events into three categories (identity, direct-invoke, and cascaded-invoke), and propose unsupervised learning algorithms to generate rules for each type of relationship. The key idea is to leverage the temporal information available in the monitoring data and extract patterns that have statistical significance. By piecing together the caller-callee relationships at each step along the invocation path, we can recover the end-to-end flow for every executed transaction. Experiments demonstrate that our algorithms outperform human experts in terms of solution quality, scale well with the data size, and are robust against noises in monitoring data.
Leveraging Service Composition Relationship to Improve CPU Demand Estimation in SOA Environments.

Guest editorial special issue on temporal data mining theory

Guest editorial special issue on temporal data mining theory

QoS%2DAware Optimization of Composite%2DService Fulfillment Policy.
Abstract — In a service-oriented IT infrastructure, functional capabilities of a computing component are externalized via one or more service interfaces. Driven by the demand for business agility and return-on-investment optimization, various dynamic service discovery and composition technologies have been proposed and developed with a common goal of enabling business-aligned fulfillment of customer requests. However, from the viewpoint of capacity planning and IT optimization, much work is still needed in helping an enterprise decide the “optimal ” IT resources necessary for deploying the atomic services in support of those composite ones. The service deployment decision must be integrated with the request fulfillment policy so that the differentiated quality-of-service (QoS) requirements of service requests can be met, for instance, with minimum hardware/software cost. In this paper, we propose an approach for QoS-aware optimization of composite-service fulfillment policy. Without loss of generality, we assume that the optimization goal is to minimize the number of machines subject to response time and throughput requirements. After presenting our approach to the optimization problem using the assumption, we show that an NP-hard throughput optimization problem must be attacked. We then illustrate how we attack the problem via an efficient heuristic algorithm. The algorithm decomposes the end-to-end response time requirement for each type of composite service into atomic-service level response time assurance, and co-locate atomic services with similar response time assurance on machines with similar utilization characteristics. The algorithm exemplifies an integrated approach to optimizing service deployment and service composition. We demonstrate that the algorithm achieves a substantially higher throughput than a common baseline algorithm. I.
Mining Infrastructure Data for System Management Optimization.

Fast Relevance Discovery in Time Series.

Fast Relevance Discovery in Time Series.

KDD%2D2006 workshop report Theory and Practice of Temporal Data Mining.

KDD%2D2006 workshop report Theory and Practice of Temporal Data Mining.

Data%2Ddriven monitoring design of service level and resource utilization.

Near%2DNeighbor Search in Pattern Distance Spaces.

Demand%2Ddriven frequent itemset mining using pattern structures.

Indexing Weighted%2DSequences in Large Databases.
We present an index structure for managing weighted sequences in large databases. A weighted-sequence is defined as a two-dimensional structure where each element in the sequence is associated with a weight. A series of network events, for instance, is a weighted-sequence in that each event has a timestamp. Querying a large sequence database by events&#039; occurrence patterns is a first step towards understanding the temporal causal relationships among the events. The index structure proposed in this paper enables us to efficiently retrieve from the database all subsequences, possibly non-contiguous, that match a given query sequence both by events and by weights. The index method also takes into consideration the non-uniform frequency distribution of events in the sequence data. In addition, our method finds a broad range of applications in indexing scientific data consisting of multiple numerical columns for discovery of correlations among these columns. For instance, indexing a DNA micro-array that records expression levels of genes under different conditions enables us to search for genes whose responses to various experimental perturbations follow a given pattern. We demonstrate, using real-world data sets, that our method is effective and efficient.
Data%2Ddriven validation

An Index Structure for Pattern Similarity Searching in DNA Microarray Dat.

User%2Ddirected Exploration of Mining Space with Multiple Attributes.

Mining Associations by Pattern Structure in Large Relational Tables.
Association rule mining aims at discovering patterns whose support is beyond a given threshold. Mining patterns composed of items described by an arbitrary subset of attributes in a large relational table represents a new challenge and has various practical applications, including the event management systems that motivated this work. The attribute combinations that define the items in a pattern provide the structural information of the pattern. Current association algorithms do not make full use of the structural information of the patterns: the information is either lost after it is encoded with attribute values, or is constrained by a given hierarchy or taxonomy. Pattern structures convey important knowledge about the patterns. In this paper, we present a novel architecture that organizes the mining space based on pattern structures. By exploiting the interrelationships among pattern structures, execution times for mining can be reduced significantly. This advantage is demonstrated by our experiments using both synthetic and real-life datasets.
Progressive and Interactive Analysis of Event Data Using Event Miner.

A Classification Approach for Prediction of Target Events in Temporal Sequences.
Learning to predict significant events from sequences of data  with categorical features is an important problem in many application areas.
Discovering actionable patterns in event data.
this paper, we  propose reducing this burden by mining  historical data that are readily available
Fast ordering of large categorical datasets for visualization.

Discovery in multi%2Dattribute data with user%2Ddefined constraints.


FARM A Framework for Exploring Mining Spaces with Multiple Attributes.


The S2%2DTree  An Index Structure for Subsequence Matching of Spatial Objects.
We present the S²-Tree, an indexing method for subsequence matching of spatial objects. The S²-Tree locates subsequences within a collection of spatial sequences, i.e., sequences made up of spatial objects, such that the subsequences match a given query pattern within a specified tolerance. Our method is based on (i) the string-searching techniques that locate substrings within a string of symbols drawn from a discrete alphabet (e.g., ASCII characters) and (ii) the spatial access methods that index (unsequenced) spatial objects. Particularly, the S²-Tree can be applied to solve problems such as subsequence matching of time-series data, where features of subsequences are often extracted and mapped into spatial objects. Moreover, it supports queries such as &#034;what is the longest common pattern of the two time series?&#034;, which previous subsequence matching algorithms find difficult to solve efficiently.
Landmarks a New Model for Similarity%2Dbased Pattern Querying in Time Series Databases.
In this paper we present the Landmark Model, a model for time series that yields new techniques for similarity-based time series pattern querying. The Landmark Model does not follow traditional similarity models that rely on pointwise Euclidean distance. Instead, it leads to Landmark Similarity, a general model of similarity that is consistent with human intuition and episodic memory. By tracking different specific subsets of features of landmarks, we can efficiently compute different Landmark Similarity measures that are invariant under corresponding subsets of six transformations; namely, Shifting, Uniform
Temporal Coupling Verification in Time Series Databases.

SQL%2FLPP A Time Series Extension of SQL Based on Limited Patience Patterns.

SQL%2FLPP  A Cascading Query Language for Temporal Correlation Verification.

